A CRC-Aided Hybrid Decoding Algorithm for Turbo Codes

Reduced-Complexity SCL Decoding of Multi-CRC-Aided Polar Codes

Cyclic redundancy check (CRC) aided polar codes are capable of achieving better performance than low-density parity-check (LDPC) codes under the successive cancelation list (SCL) decoding scheme. However, the SCL decoding scheme suffers from very high space and time complexities. Especially, the high space complexity is a major concern for adopting polar codes in modern mobile communication sta...

Algorithm for continuous decoding of turbo codes - Electronics Letters

Introduction: Optimum symbol decision algorithms for digital transmission must base their decisions on the maximum a posteriori (MAP) probability. They have been known since the early seventies [l], although they are much less popular than the Viterbi algorithm and almost never applied in practical systems. Only re cently interest in these algorithms has been revived, in connection with the pro...

Decoding of Block Turbo Codes

Turbo-decoding of Nonbinary Codes

Turbo-decoding of nonbinary codes Jens Berkmann and Frank Burkert Dept. of Communications Engineering, Technical University of Munich Arcisstr. 21, 80290 Munich, Germany Email [email protected] Abstract | It is shown how parallel concatenation of nonbinary codes can be put into the same framework of iterative decoding as in the binary case. The turbocode(turbo-decoding-) idea is...

List decoding of turbo codes

List decoding of turbo codes is analyzed under the assumption of a maximum-likelihood (ML) list decoder. It is shown that large asymptotic gains can be achieved on both the additive white Gaussian noise (AWGN) and fully interleaved flat Rayleigh-fading channels. It is also shown that the relative asymptotic gains for turbo codes are larger than those for convolutional codes. Finally, a practica...